A Knowledge Compilation Technique for ALC Tboxes
نویسندگان
چکیده
Knowledge compilation is a common technique for propositional logic knowledge bases. A given knowledge base is transformed into a normal form, for which queries can be answered efficiently. This precompilation step is expensive, but it only has to be performed once. We apply this technique to knowledge bases defined in the Description Logic ALC. We discuss an efficient satisfiability test as well as a subsumption test for precompiled concepts and Tboxes. Further we use the precompiled Tboxes for efficient Tbox reasoning. Finally we present first experimental results of our approach.
منابع مشابه
Linkless Normal Form for ALC Concepts and TBoxes
In this paper we introduce a normal form for ALC concepts and TBoxes called linkless normal form. We investigate properties of concepts given in this normal form such as an efficient satisfiability test and the calculation of uniform interpolants. We further show a way to approximate a TBox by a concept in linkless normal form, which allows us to check certain subsumptions efficiently. This mak...
متن کاملDecidability of ALC(D) for concrete domains with the EHD-property
Reasoning for Description logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. For particular, restricted concrete domains decidablity can be regained. We introduce a novel way to integrate a concrete domain D into the well-known description logic ALC, we call the resulting logic ALC(D). We then identify sufficient conditions on D that guarantee decidability of the...
متن کاملFinite Model Reasoning in ALCQI is EXPTIME Logics
Most description logics (DLs) enjoy the finite model property (FMP). This is, for example, the case for ALC [14] and many of its extensions such as ALCI (ALC with inverse roles) and ALCQ (ALC with qualifying number restrictions): for any of these logics L, each satisfiable L-concept has a finite model. This even holds if we consider concept satisfiability w.r.t. general TBoxes. However, there a...
متن کاملQuery-Based Entailment and Inseparability for ALC Ontologies (Full Version)
We investigate the problem whether two ALC knowledge bases are indistinguishable by queries over a given vocabulary. We give model-theoretic criteria and prove that this problem is undecidable for conjunctive queries (CQs) but decidable in 2EXPTIME for unions of rooted CQs. We also consider the problem whether two ALC TBoxes give the same answers to any query in a given vocabulary over all ABox...
متن کاملDescription Logics Reasoning w.r.t. General TBoxes Is Decidable for Concrete Domains with the EHD-Property
Reasoning for Description logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. However, with some restriction on the concrete domain, decidability can be regained. We introduce a novel way to integrate concrete domains D into the well-known description logic ALC, we call the resulting logic ALC(D). We then identify sufficient conditions on D that guarantee decidabi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009